Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("BARTHOLDI JJ")

Results 1 to 5 of 5

  • Page / 1
Export

Selection :

  • and

A GOOD SUBMATRIX IS HARD TO FINDBARTHOLDI JJ III.1982; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 5; PP. 190-193; BIBL. 15 REF.Article

A GUARANTEED-ACCURACY ROUND-OFF ALGORITHM FOR CYCLIC SCHEDULING AND SET COVERING = UN ALGORITHME D'ARRONDI DE PRECISION GARANTIE POUR L'ORDONNANCEMENT CYCLIQUE ET LE RECOUVREMENT D'ENSEMBLESBARTHOLDI JJ III.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 3; PP. 501-510; BIBL. 11 REF.Article

UNNETWORKS WITH APPLICATIONS TO IDLE TIME SCHEDULINGBARTHOLDI JJ; RATLIFF HD.1978; MANAG. SCI.; USA; DA. 1978; VOL. 24; NO 8; PP. 850-858; BIBL. 15 REF.Article

CYCLIC SCHEDULING VIA INTEGER PROGRAMS WITH CIRCULAR ONESBARTHOLDI JJ III; ORLIN JB; RATLIFF HD et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1074-1085; BIBL. 16 REF.Article

A MINIMAX FACILITY LAYOUT PROBLEM INVOLING DISTANCES BETWEEN AND WITHIN FACILITIES.PAPINEAU RL; FRANCIS RL; BARTHOLDI JJ et al.1975; A.I.I.E. TRANS.; U.S.A.; DA. 1975; VOL. 7; NO 4; PP. 345-355; BIBL. 11 REF.Article

  • Page / 1